Hierarchical P Systems with Randomized Right-Hand Sides of Rules
نویسندگان
چکیده
1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5, Chişinău, MD-2028, Moldova [email protected] 2 Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation, Huazhong University of Science and Technology Wuhan 430074, China 3 Faculty of Informatics, TU Wien Favoritenstraße 9–11, 1040 Vienna, Austria [email protected] 4 LACL, Université Paris Est – Créteil Val de Marne 61, av. Général de Gaulle, 94010, Créteil, France [email protected] 5 TIMC-IMAG/DyCTiM, Faculty of Medicine of Grenoble 5 avenue du Grand Sablon, 38700, La Tronche, France [email protected]
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملLevel-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-confluence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-confluence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand si...
متن کاملLevel-Con uence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-con uence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-con uence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand side...
متن کاملTermination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملA new seed projection method for solving shifted systems with multiple right-hand sides
In this paper, we propose a new seed projection method for solving shifted systems with multiple right-hand sides. This seed projection method uses a seed selection strategy. Numerical experiments are presented to show the efficiency of the newly method. Keywords—shifted systems, multiple right-hand sides, seed projection.
متن کامل